Sturmian sequence

См. также в других словарях:

• Sturmian word — In mathematics, a Sturmian word, named after Jacques Charles François Sturm, is a certain kind of infinite word. Contents 1 Definition 2 Discussion 3 History 4 Re …   Wikipedia

• Beatty sequence — A (homogeneous) Beatty sequence mathcal{B} r, is a sequence formed by successive positive integer multiples of a positive irrational number r, rounded down to the nearest integer, so that the sequence:mathcal{B} r = lfloor r floor, lfloor 2r… …   Wikipedia

• Cutting sequence — In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed ( cut ) as a curve crosses a square grid.[1] Sturmian words are a special case of cutting sequences where the curves… …   Wikipedia

• Fibonacci word — The Fibonacci word is a specific infinite sequence of binary digits (or symbols from any two letter alphabet). Definition Let S 0 be 0 and S 1 be 01 . Now S n = S {n 1}S {n 2} (the concatenation of the previous sequence and the one before that).… …   Wikipedia

• List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

• Mot de Fibonacci — Un mot de Fibonacci est une suite spécifique de lettres ou symboles pris dans un alphabet quelconque de deux lettres. Les mots de Fibonacci sont à l opération de concaténation ce que les nombres de Fibonacci sont à l addition. Caractérisation par …   Wikipédia en Français

• Combinatorics on words — Construction of a Thue Morse infinite word Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages. The study of combinatorics on words arose independently within several branches of mathematics …   Wikipedia

• Complexity function — In computer science, the complexity function of a string, a finite or infinite sequence u of letters from some alphabet, is the function of a positive integer n that counts the number of different substrings of n consecutive elements from the… …   Wikipedia